منابع مشابه
An Upper Bound for B2[2] Sequences
n = b + a, a ≤ b, a, b ∈ A. n = b + a, a < b, a, b ∈ A. n = b− a, a < b, a, b ∈ A. We say that a sequence of integers A belongs to the class of B2[g] sequences if r(n) ≤ g for any integer n. To find B2[g] sequences as dense as possible is a standard problem in additive number theory ([2],[5],[6],[7]). We define F (N, g) = max{|A|, A ⊂ [1, N ], A ∈ B2[g]}. One is interested in finding precise bo...
متن کاملAn upper bound for B2[g] sets
Suppose g is a fixed positive integer. For N 2, a set A⊂ Z∩[1,N ] is called a B2[g] set if every integer n has at most g distinct representations as n = a + b with a, b ∈ A and a b. In this paper, we give an upper bound estimate for the size of such A, improving the existing results. © 2006 Elsevier Inc. All rights reserved. MSC: 11G05; 14H52
متن کاملA new upper bound for Achlioptas processes
We consider here on-line algorithms for Achlioptas processes. Given a initially empty graph G on n vertices, a random process that at each step selects independently and uniformly at random two edges from the set of non-edges is launched. We must choose one of the two edges and add it to the graph while discarding the other. The goal is to avoid the appearance of a connected component spanning ...
متن کاملA new upper bound for 3-SAT
We show that a randomly chosen 3-CNF formula over n variables with clauses-tovariables ratio at least 4.4898 is asymptotically almost surely unsatisfiable. The previous best such bound, due to Dubois in 1999, was 4.506. The first such bound, independently discovered by many groups of researchers since 1983, was 5.19. Several decreasing values between 5.19 and 4.506 were published in the years b...
متن کاملA Linear Upper Bound in Extremal Theory of Sequences
An extremal problem considering sequences related to Davenport-Schinzel sequences is investigated in this paper. We prove that f(x1x i 2..x i kx i 1x i 2..x i k, n) = O(n) where the quantity on the left side is defined as the maximum length m of the sequence u = a1a2..am of integers such that 1) 1 ≤ ar ≤ n, 2) ar = as, r 6= s implies |r− s| ≥ k and 3) u contains no subsequence of the type x1......
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2001
ISSN: 0097-3165
DOI: 10.1006/jcta.2000.3127